Preservation and decomposition theorems for bounded degree structures
نویسندگان
چکیده
منابع مشابه
Preservation theorems for bounded formulas
In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each of these properties. These results provide simple proofs for some known results in the model theory of the bounded arithmetic theories like CPV and PV1. We use the mentioned results to obtain some independence results i...
متن کاملAutomatic Structures of Bounded Degree Revisited
It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automatic presentations, this holds even uniformly). Presenting an automatic structure of bounded degree whose theory is hard for 2EXPSPACE, we also prove this result to be optimal. These findings close the gap left open in [14].
متن کاملDifferences between Resource Bounded Degree Structures
We exhibit a structural difference between the truth-table degrees of the sets which are truth-table above 0 and the PTIME-Turing degrees of all sets. Though the structures do not have the same isomorphism type, demonstrating this fact relies on developing their common theory.
متن کاملEhrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree
Many relational structures are automatically presentable, i.e. elements of the domain can be seen as words over a finite alphabet and equality and other atomic relations are represented with finite automata. The first-order theories over such structures are known to be primitive recursive, which is shown by the inductive construction of an automaton representing any relation definable in the fi...
متن کاملEhrenfeucht-Fräıssé goes elementarily automatic for structures of bounded degree
Many relational structures are automatically presentable, i.e. elements of the domain can be seen as words over a finite alphabet and equality and other atomic relations are represented with finite automata. The first-order theories over such structures are known to be primitive recursive, which is shown by the inductive construction of an automaton representing any relation definable in the fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2015
ISSN: 1860-5974
DOI: 10.2168/lmcs-11(4:17)2015